0.00/0.12 % Problem : theBenchmark.p : TPTP v0.0.0. Released v0.0.0. 0.00/0.12 % Command : run_E %s %d THM 0.12/0.33 % Computer : n011.cluster.edu 0.12/0.33 % Model : x86_64 x86_64 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz 0.12/0.33 % Memory : 8042.1875MB 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64 0.12/0.33 % CPULimit : 1440 0.12/0.33 % WCLimit : 180 0.12/0.33 % DateTime : Thu Jul 4 07:56:54 EDT 2024 0.12/0.33 % CPUTime : 0.21/0.48 Running higher-order theorem proving 0.21/0.49 Running: /export/starexec/sandbox2/solver/bin/eprover-ho --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=180 /export/starexec/sandbox2/tmp/tmp.mHPiUKYHte/E---3.1_23131.p 12.79/2.10 # Version: 3.2.0-ho 12.79/2.10 # Preprocessing class: HSSSSMSSMSSNHHN. 12.79/2.10 # Scheduled 4 strats onto 8 cores with 180 seconds (1440 total) 12.79/2.10 # Starting pre_casc_2 with 900s (5) cores 12.79/2.10 # Starting sh2 with 180s (1) cores 12.79/2.10 # Starting sh3 with 180s (1) cores 12.79/2.10 # Starting new_ho_10 with 180s (1) cores 12.79/2.10 # new_ho_10 with pid 23212 completed with status 0 12.79/2.10 # Result found by new_ho_10 12.79/2.10 # Preprocessing class: HSSSSMSSMSSNHHN. 12.79/2.10 # Scheduled 4 strats onto 8 cores with 180 seconds (1440 total) 12.79/2.10 # Starting pre_casc_2 with 900s (5) cores 12.79/2.10 # Starting sh2 with 180s (1) cores 12.79/2.10 # Starting sh3 with 180s (1) cores 12.79/2.10 # Starting new_ho_10 with 180s (1) cores 12.79/2.10 # No SInE strategy applied 12.79/2.10 # Search class: HUUPM-FFSF32-DHHSFMNN 12.79/2.10 # Scheduled 5 strats onto 1 cores with 180 seconds (180 total) 12.79/2.10 # Starting pre_casc_2 with 109s (1) cores 12.79/2.10 # pre_casc_2 with pid 23218 completed with status 0 12.79/2.10 # Result found by pre_casc_2 12.79/2.10 # Preprocessing class: HSSSSMSSMSSNHHN. 12.79/2.10 # Scheduled 4 strats onto 8 cores with 180 seconds (1440 total) 12.79/2.10 # Starting pre_casc_2 with 900s (5) cores 12.79/2.10 # Starting sh2 with 180s (1) cores 12.79/2.10 # Starting sh3 with 180s (1) cores 12.79/2.10 # Starting new_ho_10 with 180s (1) cores 12.79/2.10 # No SInE strategy applied 12.79/2.10 # Search class: HUUPM-FFSF32-DHHSFMNN 12.79/2.10 # Scheduled 5 strats onto 1 cores with 180 seconds (180 total) 12.79/2.10 # Starting pre_casc_2 with 109s (1) cores 12.79/2.10 # Preprocessing time : 0.001 s 12.79/2.10 # Presaturation interreduction done 12.79/2.10 12.79/2.10 # Proof found! 12.79/2.10 # SZS status Theorem 12.79/2.10 # SZS output start CNFRefutation 12.79/2.10 thf(decl_22, type, zero: ($i > $i) > $i > $i). 12.79/2.10 thf(decl_23, type, one: ($i > $i) > $i > $i). 12.79/2.10 thf(decl_24, type, two: ($i > $i) > $i > $i). 12.79/2.10 thf(decl_25, type, three: ($i > $i) > $i > $i). 12.79/2.10 thf(decl_26, type, four: ($i > $i) > $i > $i). 12.79/2.10 thf(decl_27, type, five: ($i > $i) > $i > $i). 12.79/2.10 thf(decl_28, type, six: ($i > $i) > $i > $i). 12.79/2.10 thf(decl_29, type, seven: ($i > $i) > $i > $i). 12.79/2.10 thf(decl_33, type, succ: (($i > $i) > $i > $i) > ($i > $i) > $i > $i). 12.79/2.10 thf(decl_34, type, plus: (($i > $i) > $i > $i) > (($i > $i) > $i > $i) > ($i > $i) > $i > $i). 12.79/2.10 thf(decl_35, type, mult: (($i > $i) > $i > $i) > (($i > $i) > $i > $i) > ($i > $i) > $i > $i). 12.79/2.10 thf(decl_36, type, esk1_2: (($i > $i) > $i > $i) > $i > $i). 12.79/2.10 thf(decl_37, type, esk2_1: (($i > $i) > $i > $i) > $i). 12.79/2.10 thf(two_ax, axiom, ((two)=(^[X1:$i > $i, X2:$i]:(X1 @ (X1 @ X2)))), file('/export/starexec/sandbox2/tmp/tmp.mHPiUKYHte/E---3.1_23131.p', two_ax)). 12.79/2.10 thf(four_ax, axiom, ((four)=(^[X1:$i > $i, X2:$i]:(X1 @ (X1 @ (X1 @ (X1 @ X2)))))), file('/export/starexec/sandbox2/tmp/tmp.mHPiUKYHte/E---3.1_23131.p', four_ax)). 12.79/2.10 thf(succ_ax, axiom, ((succ)=(^[X3:($i > $i) > $i > $i, X1:$i > $i, X2:$i]:(X1 @ (X3 @ X1 @ X2)))), file('/export/starexec/sandbox2/tmp/tmp.mHPiUKYHte/E---3.1_23131.p', succ_ax)). 12.79/2.10 thf(three_ax, axiom, ((three)=(^[X1:$i > $i, X2:$i]:(X1 @ (X1 @ (X1 @ X2))))), file('/export/starexec/sandbox2/tmp/tmp.mHPiUKYHte/E---3.1_23131.p', three_ax)). 12.79/2.10 thf(five_ax, axiom, ((five)=(^[X1:$i > $i, X2:$i]:(X1 @ (X1 @ (X1 @ (X1 @ (X1 @ X2))))))), file('/export/starexec/sandbox2/tmp/tmp.mHPiUKYHte/E---3.1_23131.p', five_ax)). 12.79/2.10 thf(one_ax, axiom, ((one)=(^[X1:$i > $i, X2:$i]:(X1 @ X2))), file('/export/starexec/sandbox2/tmp/tmp.mHPiUKYHte/E---3.1_23131.p', one_ax)). 12.79/2.10 thf(plus_ax, axiom, ((plus)=(^[X4:($i > $i) > $i > $i, X3:($i > $i) > $i > $i, X1:$i > $i, X2:$i]:(X4 @ X1 @ (X3 @ X1 @ X2)))), file('/export/starexec/sandbox2/tmp/tmp.mHPiUKYHte/E---3.1_23131.p', plus_ax)). 12.79/2.10 thf(six_ax, axiom, ((six)=(^[X1:$i > $i, X2:$i]:(X1 @ (X1 @ (X1 @ (X1 @ (X1 @ (X1 @ X2)))))))), file('/export/starexec/sandbox2/tmp/tmp.mHPiUKYHte/E---3.1_23131.p', six_ax)). 12.79/2.10 thf(seven_ax, axiom, ((seven)=(^[X1:$i > $i, X2:$i]:(X1 @ (X1 @ (X1 @ (X1 @ (X1 @ (X1 @ (X1 @ X2))))))))), file('/export/starexec/sandbox2/tmp/tmp.mHPiUKYHte/E---3.1_23131.p', seven_ax)). 12.79/2.10 thf(zero_ax, axiom, ((zero)=(^[X1:$i > $i, X2:$i]:(X2))), file('/export/starexec/sandbox2/tmp/tmp.mHPiUKYHte/E---3.1_23131.p', zero_ax)). 12.79/2.10 thf(thm, conjecture, ?[X3:($i > $i) > $i > $i]:(((mult @ X3 @ four)=(plus @ five @ seven))), file('/export/starexec/sandbox2/tmp/tmp.mHPiUKYHte/E---3.1_23131.p', thm)). 12.79/2.10 thf(mult_ax, axiom, ((mult)=(^[X4:($i > $i) > $i > $i, X3:($i > $i) > $i > $i, X1:$i > $i, X2:$i]:(X4 @ (X3 @ X1) @ X2))), file('/export/starexec/sandbox2/tmp/tmp.mHPiUKYHte/E---3.1_23131.p', mult_ax)). 12.79/2.10 thf(c_0_12, plain, ![X10:$i > $i, X11:$i]:(((two @ X10 @ X11)=(X10 @ (X10 @ X11)))), inference(fof_simplification,[status(thm)],[inference(fof_simplification,[status(thm)],[two_ax])])). 12.79/2.10 thf(c_0_13, plain, ![X43:$i > $i, X44:$i]:(((two @ X43 @ X44)=(X43 @ (X43 @ X44)))), inference(variable_rename,[status(thm)],[c_0_12])). 12.79/2.10 thf(c_0_14, plain, ![X14:$i > $i, X15:$i]:(((four @ X14 @ X15)=(X14 @ (X14 @ (X14 @ (X14 @ X15)))))), inference(fof_simplification,[status(thm)],[inference(fof_simplification,[status(thm)],[four_ax])])). 12.79/2.10 thf(c_0_15, plain, ![X28:($i > $i) > $i > $i, X29:$i > $i, X30:$i]:(((succ @ X28 @ X29 @ X30)=(X29 @ (X28 @ X29 @ X30)))), inference(fof_simplification,[status(thm)],[inference(fof_simplification,[status(thm)],[succ_ax])])). 12.79/2.10 thf(c_0_16, plain, ![X12:$i > $i, X13:$i]:(((three @ X12 @ X13)=(X12 @ (X12 @ (X12 @ X13))))), inference(fof_simplification,[status(thm)],[inference(fof_simplification,[status(thm)],[three_ax])])). 12.79/2.10 thf(c_0_17, plain, ![X16:$i > $i, X17:$i]:(((five @ X16 @ X17)=(X16 @ (X16 @ (X16 @ (X16 @ (X16 @ X17))))))), inference(fof_simplification,[status(thm)],[inference(fof_simplification,[status(thm)],[five_ax])])). 12.79/2.10 thf(c_0_18, plain, ![X1:$i > $i, X2:$i]:(((two @ X1 @ X2)=(X1 @ (X1 @ X2)))), inference(split_conjunct,[status(thm)],[c_0_13])). 12.79/2.10 thf(c_0_19, plain, ![X47:$i > $i, X48:$i]:(((four @ X47 @ X48)=(X47 @ (X47 @ (X47 @ (X47 @ X48)))))), inference(variable_rename,[status(thm)],[c_0_14])). 12.79/2.10 thf(c_0_20, plain, ![X8:$i > $i, X9:$i]:(((one @ X8 @ X9)=(X8 @ X9))), inference(fof_simplification,[status(thm)],[inference(fof_simplification,[status(thm)],[one_ax])])). 12.79/2.10 thf(c_0_21, plain, ![X31:($i > $i) > $i > $i, X32:($i > $i) > $i > $i, X33:$i > $i, X34:$i]:(((plus @ X31 @ X32 @ X33 @ X34)=(X31 @ X33 @ (X32 @ X33 @ X34)))), inference(fof_simplification,[status(thm)],[inference(fof_simplification,[status(thm)],[plus_ax])])). 12.79/2.10 thf(c_0_22, plain, ![X61:($i > $i) > $i > $i, X62:$i > $i, X63:$i]:(((succ @ X61 @ X62 @ X63)=(X62 @ (X61 @ X62 @ X63)))), inference(variable_rename,[status(thm)],[c_0_15])). 12.79/2.10 thf(c_0_23, plain, ![X45:$i > $i, X46:$i]:(((three @ X45 @ X46)=(X45 @ (X45 @ (X45 @ X46))))), inference(variable_rename,[status(thm)],[c_0_16])). 12.79/2.10 thf(c_0_24, plain, ![X18:$i > $i, X19:$i]:(((six @ X18 @ X19)=(X18 @ (X18 @ (X18 @ (X18 @ (X18 @ (X18 @ X19)))))))), inference(fof_simplification,[status(thm)],[inference(fof_simplification,[status(thm)],[six_ax])])). 12.79/2.10 thf(c_0_25, plain, ![X49:$i > $i, X50:$i]:(((five @ X49 @ X50)=(X49 @ (X49 @ (X49 @ (X49 @ (X49 @ X50))))))), inference(variable_rename,[status(thm)],[c_0_17])). 12.79/2.10 thf(c_0_26, plain, ![X1:$i > $i, X2:$i]:(((two @ (two @ X1) @ X2)=(X1 @ (X1 @ (two @ X1 @ X2))))), inference(spm,[status(thm)],[c_0_18, c_0_18])). 12.79/2.10 thf(c_0_27, plain, ![X1:$i > $i, X2:$i]:(((four @ X1 @ X2)=(X1 @ (X1 @ (X1 @ (X1 @ X2)))))), inference(split_conjunct,[status(thm)],[c_0_19])). 12.79/2.10 thf(c_0_28, plain, ![X41:$i > $i, X42:$i]:(((one @ X41 @ X42)=(X41 @ X42))), inference(variable_rename,[status(thm)],[c_0_20])). 12.79/2.10 thf(c_0_29, plain, ![X64:($i > $i) > $i > $i, X65:($i > $i) > $i > $i, X66:$i > $i, X67:$i]:(((plus @ X64 @ X65 @ X66 @ X67)=(X64 @ X66 @ (X65 @ X66 @ X67)))), inference(variable_rename,[status(thm)],[c_0_21])). 12.79/2.10 thf(c_0_30, plain, ![X1:$i > $i, X3:($i > $i) > $i > $i, X2:$i]:(((succ @ X3 @ X1 @ X2)=(X1 @ (X3 @ X1 @ X2)))), inference(split_conjunct,[status(thm)],[c_0_22])). 12.79/2.10 thf(c_0_31, plain, ![X1:$i > $i, X2:$i]:(((three @ X1 @ X2)=(X1 @ (X1 @ (X1 @ X2))))), inference(split_conjunct,[status(thm)],[c_0_23])). 12.79/2.10 thf(c_0_32, plain, ![X51:$i > $i, X52:$i]:(((six @ X51 @ X52)=(X51 @ (X51 @ (X51 @ (X51 @ (X51 @ (X51 @ X52)))))))), inference(variable_rename,[status(thm)],[c_0_24])). 12.79/2.10 thf(c_0_33, plain, ![X1:$i > $i, X2:$i]:(((five @ X1 @ X2)=(X1 @ (X1 @ (X1 @ (X1 @ (X1 @ X2))))))), inference(split_conjunct,[status(thm)],[c_0_25])). 12.79/2.10 thf(c_0_34, plain, ![X1:$i > $i, X2:$i]:(((two @ (two @ X1) @ X2)=(two @ X1 @ (X1 @ (X1 @ X2))))), inference(spm,[status(thm)],[c_0_18, c_0_18])). 12.79/2.10 thf(c_0_35, plain, ![X1:$i > $i, X2:$i]:(((two @ (two @ X1) @ X2)=(four @ X1 @ X2))), inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26, c_0_18]), c_0_27])). 12.79/2.10 thf(c_0_36, plain, ![X20:$i > $i, X21:$i]:(((seven @ X20 @ X21)=(X20 @ (X20 @ (X20 @ (X20 @ (X20 @ (X20 @ (X20 @ X21))))))))), inference(fof_simplification,[status(thm)],[inference(fof_simplification,[status(thm)],[seven_ax])])). 12.79/2.10 thf(c_0_37, plain, ![X1:$i > $i, X2:$i]:(((one @ X1 @ X2)=(X1 @ X2))), inference(split_conjunct,[status(thm)],[c_0_28])). 12.79/2.10 thf(c_0_38, plain, ![X1:$i > $i, X3:($i > $i) > $i > $i, X4:($i > $i) > $i > $i, X2:$i]:(((plus @ X3 @ X4 @ X1 @ X2)=(X3 @ X1 @ (X4 @ X1 @ X2)))), inference(split_conjunct,[status(thm)],[c_0_29])). 12.79/2.10 thf(c_0_39, plain, ![X6:$i > $i, X7:$i]:(((zero @ X6 @ X7)=(X7))), inference(fof_simplification,[status(thm)],[inference(fof_simplification,[status(thm)],[zero_ax])])). 12.79/2.10 thf(c_0_40, plain, ![X1:$i > $i, X2:$i]:(((succ @ three @ X1 @ X2)=(four @ X1 @ X2))), inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30, c_0_31]), c_0_27])). 12.79/2.10 thf(c_0_41, plain, ![X1:$i > $i, X2:$i]:(((six @ X1 @ X2)=(X1 @ (X1 @ (X1 @ (X1 @ (X1 @ (X1 @ X2)))))))), inference(split_conjunct,[status(thm)],[c_0_32])). 12.79/2.10 thf(c_0_42, plain, ![X1:$i > $i, X2:$i]:(((X1 @ (four @ X1 @ X2))=(five @ X1 @ X2))), inference(rw,[status(thm)],[c_0_33, c_0_27])). 12.79/2.10 thf(c_0_43, plain, ![X1:$i > $i, X2:$i]:(((two @ X1 @ (X1 @ X2))=(X1 @ (two @ X1 @ X2)))), inference(spm,[status(thm)],[c_0_18, c_0_18])). 12.79/2.10 thf(c_0_44, plain, ![X1:$i > $i, X2:$i]:(((two @ X1 @ (X1 @ (X1 @ X2)))=(four @ X1 @ X2))), inference(rw,[status(thm)],[c_0_34, c_0_35])). 12.79/2.10 thf(c_0_45, plain, ![X53:$i > $i, X54:$i]:(((seven @ X53 @ X54)=(X53 @ (X53 @ (X53 @ (X53 @ (X53 @ (X53 @ (X53 @ X54))))))))), inference(variable_rename,[status(thm)],[c_0_36])). 12.79/2.10 thf(c_0_46, plain, ![X1:$i > $i, X3:($i > $i) > $i > $i, X2:$i]:(((plus @ one @ X3 @ X1 @ X2)=(X1 @ (X3 @ X1 @ X2)))), inference(spm,[status(thm)],[c_0_37, c_0_38])). 12.79/2.10 thf(c_0_47, plain, ![X39:$i > $i, X40:$i]:(((zero @ X39 @ X40)=(X40))), inference(variable_rename,[status(thm)],[c_0_39])). 12.79/2.10 thf(c_0_48, negated_conjecture, ~(?[X3:($i > $i) > $i > $i]:(((mult @ X3 @ four)=(plus @ five @ seven)))), inference(assume_negation,[status(cth)],[thm])). 12.79/2.10 thf(c_0_49, plain, ![X35:($i > $i) > $i > $i, X36:($i > $i) > $i > $i, X37:$i > $i, X38:$i]:(((mult @ X35 @ X36 @ X37 @ X38)=(X35 @ (X36 @ X37) @ X38))), inference(fof_simplification,[status(thm)],[inference(fof_simplification,[status(thm)],[mult_ax])])). 12.79/2.10 thf(c_0_50, plain, ![X1:$i > $i, X2:$i]:(((X1 @ (three @ X1 @ X2))=(four @ X1 @ X2))), inference(spm,[status(thm)],[c_0_30, c_0_40])). 12.79/2.10 thf(c_0_51, plain, ![X1:$i > $i, X2:$i]:(((X1 @ (five @ X1 @ X2))=(six @ X1 @ X2))), inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_41, c_0_27]), c_0_42])). 12.79/2.10 thf(c_0_52, plain, ![X1:$i > $i, X2:$i]:(((four @ X1 @ (X1 @ X2))=(five @ X1 @ X2))), inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_43, c_0_44]), c_0_44]), c_0_42])). 12.79/2.10 thf(c_0_53, plain, ![X1:$i > $i, X2:$i]:(((seven @ X1 @ X2)=(X1 @ (X1 @ (X1 @ (X1 @ (X1 @ (X1 @ (X1 @ X2))))))))), inference(split_conjunct,[status(thm)],[c_0_45])). 12.79/2.10 thf(c_0_54, plain, ![X1:$i > $i, X3:($i > $i) > $i > $i, X2:$i]:(((two @ (X3 @ X1) @ X2)=(plus @ X3 @ X3 @ X1 @ X2))), inference(spm,[status(thm)],[c_0_18, c_0_38])). 12.79/2.10 thf(c_0_55, plain, ![X1:$i > $i, X3:($i > $i) > $i > $i, X2:$i]:(((plus @ one @ X3 @ X1 @ X2)=(succ @ X3 @ X1 @ X2))), inference(spm,[status(thm)],[c_0_30, c_0_46])). 12.79/2.10 thf(c_0_56, plain, ![X1:$i > $i, X2:$i]:(((zero @ X1 @ X2)=(X2))), inference(split_conjunct,[status(thm)],[c_0_47])). 12.79/2.10 thf(c_0_57, negated_conjecture, ![X72:($i > $i) > $i > $i]:(((mult @ X72 @ four)!=(plus @ five @ seven))), inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_48])])])). 12.79/2.10 thf(c_0_58, plain, ![X68:($i > $i) > $i > $i, X69:($i > $i) > $i > $i, X70:$i > $i, X71:$i]:(((mult @ X68 @ X69 @ X70 @ X71)=(X68 @ (X69 @ X70) @ X71))), inference(variable_rename,[status(thm)],[c_0_49])). 12.79/2.10 thf(c_0_59, plain, ![X1:$i > $i, X2:$i]:(((three @ X1 @ (X1 @ (X1 @ X2)))=(five @ X1 @ X2))), inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31, c_0_31]), c_0_50]), c_0_42])). 12.79/2.10 thf(c_0_60, plain, ![X1:$i > $i, X2:$i]:(((two @ (three @ X1) @ X2)=(X1 @ (five @ X1 @ X2)))), inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18, c_0_31]), c_0_50]), c_0_42])). 12.79/2.10 thf(c_0_61, plain, ![X1:$i > $i, X2:$i]:(((succ @ five @ X1 @ X2)=(six @ X1 @ X2))), inference(spm,[status(thm)],[c_0_30, c_0_51])). 12.79/2.10 thf(c_0_62, plain, ![X1:$i > $i, X2:$i]:(((X1 @ (five @ X1 @ X2))=(five @ X1 @ (X1 @ X2)))), inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27, c_0_31]), c_0_50]), c_0_42]), c_0_52])). 12.79/2.10 thf(c_0_63, plain, ![X1:$i > $i, X2:$i]:(((X1 @ (X1 @ (five @ X1 @ X2)))=(seven @ X1 @ X2))), inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_53, c_0_27]), c_0_42])). 12.79/2.10 thf(c_0_64, plain, ![X3:($i > $i) > $i > $i, X1:$i > $i]:(((two @ (X3 @ X1))=(plus @ X3 @ X3 @ X1))), inference(pos_ext,[status(thm)],[c_0_54])). 12.79/2.10 thf(c_0_65, plain, ![X3:($i > $i) > $i > $i, X1:$i > $i]:(((plus @ one @ X3 @ X1)=(succ @ X3 @ X1))), inference(pos_ext,[status(thm)],[c_0_55])). 12.79/2.10 thf(c_0_66, plain, ![X1:$i > $i]:(((one @ X1)=(X1))), inference(pos_ext,[status(thm)],[c_0_37])). 12.79/2.10 thf(c_0_67, plain, ![X1:$i > $i, X2:$i]:(((succ @ zero @ X1 @ X2)=(X1 @ X2))), inference(spm,[status(thm)],[c_0_30, c_0_56])). 12.79/2.10 thf(c_0_68, plain, ![X1:$i > $i, X2:$i]:(((X1 @ (five @ X1 @ X2))=(three @ (two @ X1) @ X2))), inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18, c_0_31]), c_0_18]), c_0_35]), c_0_42])). 12.79/2.10 thf(c_0_69, negated_conjecture, ![X3:($i > $i) > $i > $i]:(((mult @ X3 @ four)!=(plus @ five @ seven))), inference(split_conjunct,[status(thm)],[c_0_57])). 12.79/2.10 thf(c_0_70, plain, ![X1:$i > $i, X4:($i > $i) > $i > $i, X3:($i > $i) > $i > $i, X2:$i]:(((mult @ X3 @ X4 @ X1 @ X2)=(X3 @ (X4 @ X1) @ X2))), inference(split_conjunct,[status(thm)],[c_0_58])). 12.79/2.10 thf(c_0_71, plain, ![X1:$i > $i, X2:$i]:(((five @ X1 @ (X1 @ X2))=(two @ (three @ X1) @ X2))), inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18, c_0_31]), c_0_59])). 12.79/2.10 thf(c_0_72, plain, ![X1:$i > $i, X2:$i]:(((two @ (three @ X1) @ X2)=(six @ X1 @ X2))), inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30, c_0_60]), c_0_61])). 12.79/2.10 thf(c_0_73, plain, ![X1:$i > $i, X2:$i]:(((two @ (three @ X1) @ (X1 @ (five @ X1 @ X2)))=(four @ (three @ X1) @ X2))), inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27, c_0_31]), c_0_50]), c_0_42]), c_0_18])). 12.79/2.10 thf(c_0_74, plain, ![X1:$i > $i, X2:$i]:(((six @ X1 @ (X1 @ X2))=(seven @ X1 @ X2))), inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30, c_0_62]), c_0_61]), c_0_63])). 12.79/2.10 thf(c_0_75, plain, ![X1:$i > $i]:(((succ @ one @ X1)=(two @ X1))), inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_64, c_0_65]), c_0_66])). 12.79/2.10 thf(c_0_76, plain, ![X1:$i > $i, X3:($i > $i) > $i > $i, X2:$i]:(((two @ (succ @ X3 @ X1) @ (X1 @ (X3 @ X1 @ X2)))=(three @ (succ @ X3 @ X1) @ X2))), inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31, c_0_30]), c_0_18])). 12.79/2.10 thf(c_0_77, plain, ![X1:$i > $i]:(((succ @ zero @ X1)=(X1))), inference(pos_ext,[status(thm)],[c_0_67])). 12.79/2.10 thf(c_0_78, plain, ![X1:$i > $i, X2:$i]:(((three @ (two @ X1) @ X2)=(six @ X1 @ X2))), inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30, c_0_68]), c_0_61])). 12.79/2.10 thf(c_0_79, plain, ![X1:$i > $i]:(((two @ (two @ X1))=(four @ X1))), inference(pos_ext,[status(thm)],[c_0_35])). 12.79/2.10 thf(c_0_80, negated_conjecture, ![X3:($i > $i) > $i > $i]:(((X3 @ (four @ (esk1_2 @ X3)) @ (esk2_1 @ X3))!=(plus @ five @ seven @ (esk1_2 @ X3) @ (esk2_1 @ X3)))), inference(rw,[status(thm)],[inference(neg_ext,[status(thm)],[c_0_69]), c_0_70])). 12.79/2.10 thf(c_0_81, plain, ![X1:$i > $i, X2:$i]:(((five @ X1 @ (X1 @ X2))=(six @ X1 @ X2))), inference(rw,[status(thm)],[c_0_71, c_0_72])). 12.79/2.10 thf(c_0_82, plain, ![X1:$i > $i, X2:$i]:(((seven @ X1 @ (five @ X1 @ X2))=(four @ (three @ X1) @ X2))), inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_73, c_0_72]), c_0_74])). 12.79/2.10 thf(c_0_83, plain, ![X1:$i > $i, X3:($i > $i) > $i > $i, X2:$i]:(((plus @ X3 @ one @ X1 @ X2)=(X3 @ X1 @ (X1 @ X2)))), inference(spm,[status(thm)],[c_0_38, c_0_37])). 12.79/2.10 thf(c_0_84, plain, ![X1:$i > $i, X2:$i]:(((succ @ one @ X1 @ X2)=(two @ X1 @ X2))), inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_54, c_0_55]), c_0_66])). 12.79/2.10 thf(c_0_85, plain, ((succ @ one)=(two)), inference(pos_ext,[status(thm)],[c_0_75])). 12.79/2.10 thf(c_0_86, plain, ![X1:$i > $i, X2:$i]:(((two @ X1 @ (X1 @ X2))=(three @ X1 @ X2))), inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_76, c_0_56]), c_0_77]), c_0_77])). 12.79/2.10 thf(c_0_87, plain, ![X1:$i > $i]:(((three @ (two @ X1))=(six @ X1))), inference(pos_ext,[status(thm)],[c_0_78])). 12.79/2.10 thf(c_0_88, plain, ![X1:$i > $i, X2:$i]:(((six @ (two @ X1) @ X2)=(three @ (four @ X1) @ X2))), inference(spm,[status(thm)],[c_0_78, c_0_79])). 12.79/2.10 thf(c_0_89, negated_conjecture, ![X3:($i > $i) > $i > $i]:(((five @ (esk1_2 @ X3) @ (seven @ (esk1_2 @ X3) @ (esk2_1 @ X3)))!=(X3 @ (four @ (esk1_2 @ X3)) @ (esk2_1 @ X3)))), inference(spm,[status(thm)],[c_0_80, c_0_38])). 12.79/2.10 thf(c_0_90, plain, ![X1:$i > $i, X2:$i]:(((five @ X1 @ (seven @ X1 @ X2))=(four @ (three @ X1) @ X2))), inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_81, c_0_63]), c_0_74]), c_0_82])). 12.79/2.10 thf(c_0_91, plain, ![X1:$i > $i, X2:$i]:(((plus @ two @ one @ X1 @ X2)=(three @ X1 @ X2))), inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_83, c_0_84]), c_0_85]), c_0_86])). 12.79/2.10 thf(c_0_92, plain, ![X1:$i > $i]:(((two @ (three @ X1))=(six @ X1))), inference(pos_ext,[status(thm)],[c_0_72])). 12.79/2.10 thf(c_0_93, plain, ![X1:$i > $i, X2:$i]:(((two @ (six @ X1) @ X2)=(three @ (four @ X1) @ X2))), inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_72, c_0_87]), c_0_88])). 12.79/2.10 thf(c_0_94, negated_conjecture, ![X3:($i > $i) > $i > $i]:(((four @ (three @ (esk1_2 @ X3)) @ (esk2_1 @ X3))!=(X3 @ (four @ (esk1_2 @ X3)) @ (esk2_1 @ X3)))), inference(rw,[status(thm)],[c_0_89, c_0_90])). 12.79/2.10 thf(c_0_95, plain, ((plus @ two @ one)=(three)), inference(pos_ext,[status(thm)],[c_0_91])). 12.79/2.10 thf(c_0_96, plain, ![X1:$i > $i, X2:$i]:(((three @ (four @ X1) @ X2)=(four @ (three @ X1) @ X2))), inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_35, c_0_92]), c_0_93])). 12.79/2.10 thf(c_0_97, negated_conjecture, ($false), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_94, c_0_91]), c_0_95]), c_0_95]), c_0_96]), c_0_95]), c_0_95])]), ['proof']). 12.79/2.10 # SZS output end CNFRefutation 12.79/2.10 # Parsed axioms : 29 12.79/2.10 # Removed by relevancy pruning/SinE : 0 12.79/2.10 # Initial clauses : 29 12.79/2.10 # Removed in clause preprocessing : 14 12.79/2.10 # Initial clauses in saturation : 15 12.79/2.10 # Processed clauses : 2772 12.79/2.10 # ...of these trivial : 1628 12.79/2.10 # ...subsumed : 322 12.79/2.10 # ...remaining for further processing : 822 12.79/2.10 # Other redundant clauses eliminated : 0 12.79/2.10 # Clauses deleted for lack of memory : 0 12.79/2.10 # Backward-subsumed : 0 12.79/2.10 # Backward-rewritten : 226 12.79/2.10 # Generated clauses : 91748 12.79/2.10 # ...of the previous two non-redundant : 77171 12.79/2.10 # ...aggressively subsumed : 0 12.79/2.10 # Contextual simplify-reflections : 0 12.79/2.10 # Paramodulations : 91254 12.79/2.10 # Factorizations : 0 12.79/2.10 # NegExts : 25 12.79/2.10 # Equation resolutions : 0 12.79/2.10 # Disequality decompositions : 0 12.79/2.10 # Total rewrite steps : 334397 12.79/2.10 # ...of those cached : 312721 12.79/2.10 # Propositional unsat checks : 0 12.79/2.10 # Propositional check models : 0 12.79/2.10 # Propositional check unsatisfiable : 0 12.79/2.10 # Propositional clauses : 0 12.79/2.10 # Propositional clauses after purity: 0 12.79/2.10 # Propositional unsat core size : 0 12.79/2.10 # Propositional preprocessing time : 0.000 12.79/2.10 # Propositional encoding time : 0.000 12.79/2.10 # Propositional solver time : 0.000 12.79/2.10 # Success case prop preproc time : 0.000 12.79/2.10 # Success case prop encoding time : 0.000 12.79/2.10 # Success case prop solver time : 0.000 12.79/2.10 # Current number of processed clauses : 581 12.79/2.10 # Positive orientable unit clauses : 456 12.79/2.10 # Positive unorientable unit clauses: 49 12.79/2.10 # Negative unit clauses : 76 12.79/2.10 # Non-unit-clauses : 0 12.79/2.10 # Current number of unprocessed clauses: 73210 12.79/2.10 # ...number of literals in the above : 73210 12.79/2.10 # Current number of archived formulas : 0 12.79/2.10 # Current number of archived clauses : 241 12.79/2.10 # Clause-clause subsumption calls (NU) : 0 12.79/2.10 # Rec. Clause-clause subsumption calls : 0 12.79/2.10 # Non-unit clause-clause subsumptions : 0 12.79/2.10 # Unit Clause-clause subsumption calls : 2042 12.79/2.10 # Rewrite failures with RHS unbound : 0 12.79/2.10 # BW rewrite match attempts : 52386 12.79/2.10 # BW rewrite match successes : 331 12.79/2.10 # Condensation attempts : 2772 12.79/2.10 # Condensation successes : 0 12.79/2.10 # Termbank termtop insertions : 5170330 12.79/2.10 # Search garbage collected termcells : 87 12.79/2.10 12.79/2.10 # ------------------------------------------------- 12.79/2.10 # User time : 1.488 s 12.79/2.10 # System time : 0.065 s 12.79/2.10 # Total time : 1.553 s 12.79/2.10 # Maximum resident set size: 1744 pages 12.79/2.10 12.79/2.10 # ------------------------------------------------- 12.79/2.10 # User time : 1.490 s 12.79/2.10 # System time : 0.067 s 12.79/2.10 # Total time : 1.556 s 12.79/2.10 # Maximum resident set size: 1736 pages 12.79/2.10 % E---3.1 exiting 12.79/2.10 % E exiting 12.79/2.10 EOF